COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	\magnification\magstephalf
C00005 ENDMK
C⊗;
\magnification\magstephalf
\input macro.tex
\def\today{\ifcase\month\or
  January\or February\or March\or April\or May\or June\or
  July\or August\or September\or October\or November\or December\fi
  \space\number\day, \number\year}
\baselineskip 14pt
\rm
\parskip 6pt
\line{\sevenrm a85.tex[106,phy] \today\hfill}


\bigskip
\line{\bf Final Project.\hfill}

In the game of Scrabble$↓{\;{\rm\bf TM}\;}$, a player has a rack of up to
seven letters, each with a point value. 

\medskip\noindent
Project A:

Your program should deal or exchange letters to players on request. It should
use a file containing an allowed word list, with options to check an
individual word, check every word, or check no words against the dictionary.

\medskip\noindent
Project B:

Your program should itself, in some reasonably efficient way, try to find the
highest-scoring word that can be made using a given collection of letters. 
This might entail constructing a modified dictionary; one way to do so is
to store with each word an alphabetized anagram (with {\tt RETINA},
store {\tt AEINRT}) and reorder the dictionary so that the anagrams are in
alphabetical order. In some circumstances, reversing the anagrams
({\tt TRNIEA}) can be useful. Discussing the feasibility of your algorithm
with an expert is appropriate.


\bigskip
\line{\copyright 1985 Robert W. Floyd\hfill}
\line{First draft (not published) April 8, l985.\hfill}

\bye